On Factors of Nonsingular Cartesian Products
نویسنده
چکیده
We classify all factors of the Cartesian product of any two nonsingular type III , 0 < < 1, or II1, Chacon transformations, as well as the centralizer of nite Cartesian products of such transformations. AMS 1991 subject classi cation: 28D99.
منابع مشابه
Rank One Power Weakly Mixing Nonsingular Transformations
We show that Chacon's nonsingular type III transformation T , 0 < 1, is power weakly mixing, i.e., for all sequences of nonzero integers fk1; : : : ; krg, T k1 : : : T kr is ergodic. We then show that in in nite measure, this condition is not implied by in nite ergodic index (having all nite Cartesian products ergodic), and that in nite ergodic index does not imply 2-recurrence.
متن کاملCartesian closed subcategories of topological fuzzes
A category $mathbf{C}$ is called Cartesian closed provided that it has finite products and for each$mathbf{C}$-object $A$ the functor $(Atimes -): Ara A$ has a right adjoint. It is well known that the category $mathbf{TopFuzz}$ of all topological fuzzes is both complete and cocomplete, but it is not Cartesian closed. In this paper, we introduce some Cartesian closed subcategories of this cat...
متن کاملOn the outer independent 2-rainbow domination number of Cartesian products of paths and cycles
Let G be a graph. A 2-rainbow dominating function (or 2-RDF) of G is a function f from V(G) to the set of all subsets of the set {1,2} such that for a vertex v ∈ V (G) with f(v) = ∅, thecondition $bigcup_{uin N_{G}(v)}f(u)={1,2}$ is fulfilled, wher NG(v) is the open neighborhoodof v. The weight of 2-RDF f of G is the value$omega (f):=sum _{vin V(G)}|f(v)|$. The 2-rainbowd...
متن کاملPacking and Domination Invariants on Cartesian Products and Direct Products
The dual notions of domination and packing in finite simple graphs were first extensively explored by Meir and Moon in [15]. Most of the lower bounds for the domination number of a nontrivial Cartesian product involve the 2-packing, or closed neighborhood packing, number of the factors. In addition, the domination number of any graph is at least as large as its 2-packing number, and the invaria...
متن کاملDifferent-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کامل